UPPER BOUND FOR MONOIDAL TOPOLOGICAL COMPLEXITY

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Upper Bound for the Complexity of Transformation Semigroups

A transformation semigroup (ts) X = (Q,, S,) in this paper consists of a finite set of states Qx and a subsemigroup of transformations S, of PF(Q,), the monoid of all partial functions on Q, with composition as multiplication. For n > 1, ii’ denotes the transformation monoid (tm) with n states and with the n constant maps on those n states (along with the identity function) as transformations. ...

متن کامل

P-subgraph Isomorphism Computation and Upper Bound Complexity Estimation

An approach for subgraph isomorphism computation of parameter-ized graphs will be presented. Parameterized graphs (short: p-graphs) are extensions of undirected graphs by parameter vectors at the nodes and edges. We will deene p-graphs and basic concepts of subgraph isomorphism computation for p-graphs. A bottom-up algorithm for p-subgraph isomorphism computation according to a given search gra...

متن کامل

Upper Bound on Syntactic Complexity of Suffix-Free Languages

We solve an open problem concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a suffix-free language with n left quotients (that is, with state complexity n) is at most (n − 1) + n − 2 for n > 6. Since this bound is known to be reachable, this settles the problem. We also reduce the alphabet of the witness languages reaching this bound to five letters ins...

متن کامل

A New Upper Bound on the Complexity of Derivative Evaluation

Let T(n) denote the number of arithmetic operations needed to evaluate the normalized derivatives P ^ ( t ) / i ! , i = 0,...,n, for an nth degree polynomial p(t) over the field of complex numbers. We show 1 2 T(n) ^ — c n log n + lower order terms where c may be taken as 12.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kyushu Journal of Mathematics

سال: 2020

ISSN: 1340-6116,1883-2032

DOI: 10.2206/kyushujm.74.197